Derivative free gradient projection algorithms for rotation
نویسندگان
چکیده
منابع مشابه
Benchmarking Derivative-Free Optimization Algorithms
We propose data profiles as a tool for analyzing the performance of derivativefree optimization solvers when there are constraints on the computational budget. We use performance and data profiles, together with a convergence test that measures the decrease in function value, to analyze the performance of three solvers on sets of smooth, noisy, and piecewise-smooth problems. Our results provide...
متن کاملA class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
In this paper we study a class of derivative-free unconstrained minimization algorithms employing nonmonotone inexact linesearch techniques along a set of suitable search directions. In particular, we define globally convergent nonmonotone versions of some well-known derivativefree methods and we propose a new algorithm combining coordinate rotations with approximate simplex gradients. Through ...
متن کاملExperimental Comparisons of Derivative Free Optimization Algorithms
— In this paper, the performances of the quasi-Newton BFGS algorithm, the NEWUOA derivative free optimizer, the Covariance Matrix Adaptation Evolution Strategy (CMA-ES), the Differential Evolution (DE) algorithm and Particle Swarm Optimizers (PSO) are compared experimentally on benchmark functions reflecting important challenges encountered in real-world optimization problems. Dependence of the...
متن کاملTwo derivative-free optimization algorithms for mesh quality improvement
High-quality meshes are essential in the solution of partial differential equations (PDEs), which arise in numerous science and engineering applications, as the mesh quality affects the solution accuracy, the solver execution time, and the problem conditioning. Mesh quality improvement is necessary when the mesh is of less than desirable quality (either from mesh generation or deformation). Non...
متن کاملNew Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
This paper presents sequential and parallel derivative-free algorithms for finding a local minimum of smooth and nonsmooth functions of practical interest. It is proved that, under mild assumptions, a sufficient decrease condition holds for a nonsmooth function. Based on this property, the algorithms explore a set of search directions and move to a point with a sufficiently lower functional val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Psychometrika
سال: 2004
ISSN: 0033-3123,1860-0980
DOI: 10.1007/bf02295647